Excluding Agency

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Excluding infinite minors

Robertson, N., P. Seymour and R. Thomas, Excluding infinite minors, Discrete Mathematics 95 (1991) 303-319. Let K be an infinite cardinal, and let H be either a complete graph with K vertices, or a tree in which every vertex has valency K. What can we say about graphs G which (i) have no minor isomorphic to H, or (ii) contain no sub graph which is a subdivision of H? These four questions are an...

متن کامل

Excluding a Countable Clique

We extend the excluded Kn minor theorem of Robertson and Seymour to infinite graphs, and deduce a structural characterization of the infinite graphs that have no Kא0 minor. The latter is a refinement of an earlier characterization of Robertson, Seymour and the second author.

متن کامل

Excluding induced subgraphs

Given two graphs, G and H, we say that H is an induced subgraph of G if V (H) ⊆ V (G), and two vertices of H are adjacent if and only if they are adjacent in G. Let F be a (possibly infinite) family of graphs. A graph G is called F -free if no member of F is isomorphic to an induced subgraph of G. A clique in a graph is a set of vertices all pairwise adjacent, and a stable set is a set of verti...

متن کامل

Excluding paths and antipaths

The Erdős-Hajnal conjecture states that for every graph H, there exists a constant δ(H) > 0, such that if a graph G has no induced subgraph isomorphic to H, then G contains a clique or a stable set of size at least |V (G)|. This conjecture is still open. We consider a variant of the conjecture, where instead of excluding H as an induced subgraph, both H and H are excluded. We prove this modifie...

متن کامل

Excluding a small minor

There are sixteen 3-connected graphs on eleven or fewer edges. For each of these graphs H we discuss the structure of graphs that do not contain a minor isomorphic to H.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: M/C Journal

سال: 2020

ISSN: 1441-2616

DOI: 10.5204/mcj.2725